Convergence of Monte Carlo distribution estimates from rival samplers
نویسندگان
چکیده
منابع مشابه
Sequential Monte Carlo Samplers
In this paper, we propose a methodology to sample sequentially from a sequence of probability distributions known up to a normalizing constant and defined on a common space. These probability distributions are approximated by a cloud of weighted random samples which are propagated over time using Sequential Monte Carlo methods. This methodology allows us to derive simple algorithms to make para...
متن کاملSequential Monte Carlo Samplers for Rare Events
We present novel sequential Monte Carlo (SMC) algorithms for the simulation of two broad classes of rare events which are suitable for the estimation of tail probabilities and probability density functions in the regions of rare events, as well as the simulation of rare system trajectories. These methods have some connection with previously proposed importance sampling (IS) and interacting part...
متن کاملPopulation Monte Carlo Samplers for Rendering
We present novel samplers and algorithms for Monte Carlo rendering. The adaptive image-plane sampler selects pixels for refinement according to a perceptually-weighted variance criteria. The hemispheric integrals sampler learns an importance sampling function for computing common rendering integrals. Both algorithms, which are unbiased, are derived in the generic Population Monte Carlo statisti...
متن کاملA convergence criterion for the Monte Carlo estimates
In this article, a convergence criterion for the Monte Carlo estimates, which can be used as a stopping rule for the Monte Carlo experiments, will be proposed. The proposed criterion seeks a convergence band of a given width and length such that the probability of the Monte Carlo sample means to fall outside of this band is practically null. Although it has some sort of self defined confidence,...
متن کاملMeasuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming
A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and MetropolisHastings, produce output samples drawn from a distribution that may be far from the target posterior distribution. This paper shows how to upper-bound the symmetric KL d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2015
ISSN: 0960-3174,1573-1375
DOI: 10.1007/s11222-015-9595-0